Convex invariants in multipartite tournaments
نویسندگان
چکیده
In the study of convexity spaces, the most common convex invariants are based on notions of independence with respect to taking convex hulls. In [D.B. Parker, R.F. Westhoff and M.J. Wolf, Discuss. Math. Graph Theory 29 (2009), 51–69], H-independence, R-independence and convex independence were studied to prove results about the Helly number, Radon number and rank of a clone-free multipartite tournament under 2-path convexity. In this paper, we extend many of these results to general multipartite tournaments. In particular, we determine conditions under which a convexly independent set of vertices is Rand/or H-independent. We also investigate conditions under which an R-independent set is Hindependent.
منابع مشابه
Convex independence and the structure of clone-free multipartite tournaments
We investigate the convex invariants associated with two-path convexity in clonefree multipartite tournaments. Specifically, we explore the relationship between the Helly number, Radon number and rank of such digraphs. The main result is a structural theorem that describes the arc relationships among certain vertices associated with vertices of a given convexly independent set. We use this to p...
متن کاملDetermining properties of a multipartite tournament from its lattice of convex subsets
The collection of convex subsets of a multipartite tournament T forms a lattice C(T ). Given a lattice structure for C(T ), we deduce properties of T . In particular, we find conditions under which we can detect clones in T . We also determine conditions on the lattice which will imply that T is bipartite, except for a few cases. We classify the ambiguous cases. Finally, we study a property of ...
متن کاملOn two-path convexity in multipartite tournaments
In the context of two-path convexity, we study the rank, Helly number, Radon number, Caratheodory number, and hull number for multipartite tournaments. We show the maximum Caratheodory number of a multipartite tournament is 3. We then derive tight upper bounds for rank in both general multipartite tournaments and clone-free multipartite tournaments. We show that these same tight upper bounds ho...
متن کاملTwo-path convexity in clone-free regular multipartite tournaments
We present some results on two-path convexity in clone-free regular multipartite tournaments. After proving a structural result for regular multipartite tournaments with convexly independent sets of a given size, we determine tight upper bounds for their size (called the rank) in clone-free regular bipartite and tripartite tournaments. We use this to determine tight upper bounds for the Helly a...
متن کاملWeakly Hamiltonian-connected ordinary multipartite tournaments
We characterize weakly Hamiltonian-connected ordinary multipartite tournaments. Our result generalizes such a characterization for tournaments by Thomassen and implies a polynomial algorithm to decide the existence of a Hamiltonian path connecting two given vertices in an ordinary multipartite tournament and find one, if it exists.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 54 شماره
صفحات -
تاریخ انتشار 2012